Coding with permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coding Parking Functions by Pairs of Permutations

We introduce a new class of admissible pairs of triangular sequences and prove a bijection between the set of admissible pairs of triangular sequences of length n and the set of parking functions of length n. For all u and v = 0, 1, 2, 3 and all n ≤ 7 we describe in terms of admissible pairs the dimensions of the bi-graded components hu,v of diagonal harmonics C[x1, . . . , xn; y1, . . . , yn]/...

متن کامل

Covering n-Permutations with (n+1)-Permutations

Let Sn be the set of all permutations on [n] := {1, 2, . . . , n}. We denote by κn the smallest cardinality of a subset A of Sn+1 that “covers” Sn, in the sense that each π ∈ Sn may be found as an order-isomorphic subsequence of some π′ in A. What are general upper bounds on κn? If we randomly select νn elements of Sn+1, when does the probability that they cover Sn transition from 0 to 1? Can w...

متن کامل

Permutations with Inversions

The number of inversions in a random permutation is a way to measure the extent to which the permutation is “out of order”. Let In(k) denote the number of permutations of length n with k inversions. This paper gives asymptotic formulae for the sequences {In+k(n), n = 1, 2, . . .} for fixed k.

متن کامل

Permutations with Kazhdan

Using resolutions of singularities introduced by Cortez and a method for calculating Kazhdan-Lusztig polynomials due to Polo, we prove the conjecture of Billey and Braden characterizing permutations w with Kazhdan-Lusztig polynomial Pid,w(q) = 1 + q for some h.

متن کامل

Permutations with interval cycles

We study permutations of the set [n] = {1, 2, . . . , n} written in cycle notation, for which each cycle forms an increasing or decreasing interval of positive integers. More generally, permutations whose cycle elements form arithmetic progressions are considered. We also investigate the class of generalised interval permutations, where each cycle can be rearranged in increasing order to form a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1979

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(79)90076-7